- problem of graph isomorphism can be solved efficiency (i.e. in polynomial-time)
- Макаров: проблема полиморфизма графов может быть решена эффективно (т.е. в полиномиальном времени)
Универсальный англо-русский словарь. Академик.ру. 2011.
problem of graph isomorphism can be solved efficiency (i.e. in polynomial-time)
Смотреть что такое "problem of graph isomorphism can be solved efficiency (i.e. in polynomial-time)" в других словарях:
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
